Logical Structures Underlying Quantum Computing
نویسندگان
چکیده
منابع مشابه
Algebraic Structures Underlying Quantum Information Protocols
In this paper, we describe the teleportation from the viewpoints of the braid group and Temperley–Lieb algebra. We propose the virtual braid teleportation which exploits the teleportation swapping and identifies unitary braid representations with universal quantum gates, and suggest the braid teleportation which is explained in terms of the crossed measurement and the state model of knot theory...
متن کاملLogical Interpretation of a Reversible Measurement in Quantum Computing
We give the logical description of a new kind of quantum measurement that is a reversible operation performed by a hypothetical insider observer, or, which is the same, a quantum measurement made in a quantum space background, like the fuzzy sphere. The result is that the non-contradiction and the excluded middle principles are both invalidated, leading to a paraconsistent, symmetric logic. Our...
متن کاملData Structures in Classical and Quantum Computing
This survey summarizes several results about quantum computing related to (mostly static) data structures. First, we describe classical data structures for the set membership and the predecessor search problems: Perfect Hash tables for set membership from the paper [8] by Fredman, Komlós and Szemerédi and a data structure by Beame and Fich for predecessor search presented in [3]. We also prove ...
متن کاملSimilarity - Projection structures : the logical geometry of Quantum Physics ∗
Similarity-Projection structures abstract the numerical properties of real scalar product of rays and projections in Hilbert spaces to provide a more general framework for Quantum Physics. They are characterized by properties that possess direct physical meaning. They provide a formal framework that subsumes both classical boolean logic concerned with sets and subsets and quantum logic concerne...
متن کاملApplication of quantum walks on graph structures to quantum computing
Quantum computation is a new computational paradigm which can provide fundamentally faster computation than in the classical regime. This is dependent on finding efficient quantum algorithms for problems of practical interest. One of the most successful tools in developing new quantum algorithms is the quantum walk. In this thesis, we explore two applications of the discrete time quantum walk. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Entropy
سال: 2019
ISSN: 1099-4300
DOI: 10.3390/e21010077